Singular value decomposition of large random matrices (for two-way classification of microarrays)

Asymptotic behavior of the singular value decomposition (SVD) of blown up matrices and normalized blown up contingency tables exposed to Wigner-noise is investigated. It is proved that such an m×n matrix almost surely has a constant number of large singular values (of order √ mn), while the rest of the singular values are of order √ m + n as m,n → ∞. Concentration results of Alon at al. for the eigenvalues of large symmetric random matrices are adapted to the rectangular case, and on this basis, almost sure results for the singular values as well as for the corresponding isotropic subspaces are proved. An algorithm, applicable to two-way classification of microarrays, is also given that finds the underlying block structure.